The Vampire and the FOOL Evgenii Kotelnikov Laura Kov´acs Giles Reger

Source URL: www.cs.man.ac.uk

• Software engineering
• Mathematical logic
• Theoretical computer science
• Formal methods
• Logic in computer science
• Model theory
• Computability theory
• Procedural programming languages
• First-order logic
• Automated theorem proving
• ALGOL 68
• Let expression

The Potential of Interference-Based Proof Systems Marijn J.H. Heule1 and Benjamin Kiesl2 1 2 Department of Computer Science, The University of Texas at Austin

Source URL: www.cs.man.ac.uk

• Logic
• Mathematical logic
• Mathematics
• Propositional calculus
• Logical truth
• Logic in computer science
• Syntax
• Automated theorem proving
• Resolution
• Frege system
• Boolean satisfiability problem
• First-order logic

A Case for Query-driven Predicate Answer Set Programming (Position Paper) Gopal Gupta Elmer Salazar, Kyle Marple, Zhuo Chen, Farhad Shakerin Department of Computer Science The University of Texas at Dallas

Source URL: www.cs.man.ac.uk

• Artificial intelligence
• Logic
• Logic programming
• Declarative programming
• Automated reasoning
• Programming paradigms
• Automated theorem proving
• Answer set programming
• Reasoning system
• Stable model semantics
• Prolog
• Inference

Selecting the Selection? Kryˇstof Hoder, Giles Reger1 , Martin Suda1 , and Andrei Voronkov1,2,3 1 2

Source URL: www.cs.man.ac.uk

• Logic
• Automated theorem proving
• Propositional calculus
• Mathematical logic
• Logic programming
• Mathematics
• Rules of inference
• Resolution
• Clause
• Literal
• Unit propagation
• E theorem prover

From First-order Temporal Logic to Parametric Trace Slicing Giles Reger and David Rydeheard University of Manchester, Manchester, UK Abstract. Parametric runtime verification is the process of verifying properties of ex

Source URL: www.cs.man.ac.uk

• Temporal logic
• Formal languages
• Logic
• Metalogic
• Mathematical logic
• Linear temporal logic
• Mathematics
• Model theory
• Symbol
• Computation tree logic
• Interpretation
• Well-formed formula

Considering Typestate Verification for Quantified Event Automata Giles Reger University of Manchester, Manchester, UK Abstract. This paper discusses how the existing static analyses developed for

Source URL: www.cs.man.ac.uk

• Program analysis
• Typestate analysis
• Mathematical logic
• Logic
• Mathematics
• Runtime verification
• Quantifier
• Type system
• Sheaf

Figure 1: How to get to Hello Monkey. The dinner of the ARCADE workshop will be held in the restaurant Hello Monkey (http:// hellomonkey.net/magasinsgatan). Its address is Magasinsgatan 26 (D). The most direct way to get

Source URL: www.cs.man.ac.uk

Revisiting Question Answering in Vampire Giles Reger School of Computer Science, University of Manchester, UK The 4th Vampire Workshop

Source URL: www.cs.man.ac.uk

• Automated theorem proving
• Resolution
• IP
• X0
• Vampire
• Mathematics
• Propositional calculus
• Logic

Challenges for Fast Synthesis Procedures in SMT Andrew Reynolds1 Department of Computer Science, The University of Iowa Abstract A number of synthesis applications are made possible by automated tools for synthesis. Rece

Source URL: www.cs.man.ac.uk

• Mathematical logic
• Theoretical computer science
• Mathematics
• Quantification
• Logic in computer science
• Formal methods
• Electronic design automation
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Universal quantification
• True quantified Boolean formula

M AR Q: Monitoring At Runtime with QEA Giles Reger, Helena Cuenca Cruz and David Rydeheard University of Manchester Abstract. Runtime monitoring is the process of checking whether an execution trace of a running system s

Source URL: www.cs.man.ac.uk

• Mathematical logic
• Logic
• Theoretical computer science
• Logic in computer science
• Runtime verification
• FO
• Quantifier